package com.zelix;

import java.io.*;
import java.util.*;

public class rt extends pt {

    int o;
    int p;
    int q;
    int r;
    du s;
    eu t[];
    pt u[];
    private static String z[];

    public rt(zs zs, int i, int j, du du1, eu aeu[]) {
        super(null, zs, du1.s() + aeu.length * 8);
        o = i;
        p = j;
        s = du1;
        s.a(this);
        q = aeu.length;
        t = aeu;
        r = 0;
        u = new pt[r];
    }

    rt(kt kt1, int i, String s1, jb jb, qy qy1, qy qy2, PrintWriter printwriter,
       ty ty)
            throws IOException, dc, tb {
        super(kt1, i, s1, jb, qy1);
        qy qy3;
        int j;

        o = jb.readUnsignedShort();
        p = jb.readUnsignedShort();
        qy3 = new qy(Math.max(5, (int) ((double) super.q() * 0.10000000000000001D)), 3);
        s = new du(this, jb, qy3);
        q = jb.readUnsignedShort();
        t = new eu[q];
        for (j = 0; j < q; j++) {
            t[j] = new eu(this, jb, qy3);
        }
        int k;
        r = jb.readUnsignedShort();
        u = new pt[r];
        for (k = 0; k < r; k++) {
            u[k] = pt.a(this, jb, qy1, qy2, printwriter, qy3, ty);
            if (u[k] instanceof au)
                ((mt) h()).f();
        }
        s.a(qy3, printwriter);

    }

    void a(Vector vector)
            throws tb {
        int i;
        xt xt1;
        int j;
        int k;
        i = u.length;
        mt mt1 = (mt) h();
        zs zs = mt1.a(z[1], vector);
        xt1 = xt.a(mt1, zs);
        j = -1;
        for (k = 0; k < i; k++) {
            if (u[k].l.equals(z[1])) {
                j = k;
                break;
            }
        }

        if (j != -1) {
            u[j] = xt1;
        } else {
            pt apt[] = new pt[i + 1];
            System.arraycopy(u, 0, apt, 0, i);
            apt[i] = xt1;
            u = apt;
        }
        r = u.length;
        super.m = q();
    }

    public boolean b(int i) {
        int j;
        for (j = 0; j < u.length; j++) {
            if (u[j] instanceof wt)
                return ((wt) u[j]).b(i);
        }
        return false;
    }

    void a(PrintWriter printwriter, int i) {
        StringBuffer stringbuffer;
        int j;
        printwriter.println("");
        stringbuffer = new StringBuffer(i);
        for (j = 0; j < i; j++) {
            stringbuffer.append(z[9]);
        }
        for (int k = 0; k < t.length; k++) {
            t[k].a(printwriter, stringbuffer);

        }
    }

    public void a(um um, wg wg, lm lm1, Vector vector)
            throws tb, sb, ub {
        au au1;
        zs zs;
        if (s != null) {
            au1 = B();
            if (au1 != null) {
                zs = au1.u();
            } else {
                zs = lm1.a(z[0], vector);
            }
            au au2 = new au(this, zs, 0);
            vm vm1 = s.a(um, wg);
            pu apu[] = vm1.a(au2, lm1, vector);
            int ai[] = vm1.h();
            vm1.a();
            s.a(ai);
            au2.a(apu);
            if (au1 != null) {
                int i = C();
                u[i] = au2;
            } else if (au2.t() > 0) {
                pt apt[] = new pt[r + 1];
                System.arraycopy(u, 0, apt, 0, r);
                apt[r] = au2;
                u = apt;
                r++;
            }
        }
    }

    public void b(um um, wg wg, lm lm1, Vector vector)
            throws tb, sb {
        t6 t6_1;
        zs zs;
        if (s != null) {
            t6_1 = a();
            if (t6_1 != null) {
                zs = t6_1.d();
            } else {
                zs = lm1.a(z[6], vector);
            }
            t6 t6_2 = new t6(this, zs, 0);
            vm vm1 = s.a(um, wg);
            s6 as6[] = vm1.a(t6_2, lm1, vector);
            int ai[] = vm1.h();
            vm1.a();
            s.a(ai);
            t6_2.a(as6);
            if (t6_1 != null) {
                int i = c();
                u[i] = t6_2;
            } else if (t6_2.c() > 0) {
                pt apt[] = new pt[r + 1];
                System.arraycopy(u, 0, apt, 0, r);
                apt[r] = t6_2;
                u = apt;
                r++;
            }
        }
    }

    du s() {
        return s;
    }

    public int d() {
        return s.s();
    }

    eu[] t() {
        return t;
    }

    int q()
            throws tb {
        int i;
        int j;
        i = 4 + s.s() + 2 + q * 8 + 2;
        for (j = 0; j < r; j++) {
            i += u[j].a();

        }
        super.m = i;
        return i;
    }

    wt u() {
        int i;
        for (i = 0; i < u.length; i++) {
            if (u[i] instanceof wt)
                return (wt) u[i];
        }

        return null;
    }

    public int v() {
        return p;
    }

    public int w() {
        return o;
    }

    String x() {
        return ((ou) n()).u();
    }

    Vector y() {
        return ((ou) n()).Q();
    }

    String z() {
        return j().replace('/', '.') + " " + ((ou) n()).d(false);
    }

    qy a(Map map, ko ko, sy sy, sy sy1, sy sy2, um um, HashMap hashmap,
         HashMap hashmap1, HashMap hashmap2, HashMap hashmap3, yg yg, Map map1, fy fy, qy qy1,
         fy fy1, fy fy2, fy fy3, HashSet hashset, Vector vector, boolean flag)
            throws sb {
        return s.a(map, ko, sy, sy1, sy2, fy3, um, hashmap, hashmap1, hashmap2, hashmap3, yg, map1, fy, qy1, fy1, fy2, hashset, vector, flag);
    }

    int A() {
        return s.w();
    }

    au B() {
        int i;
        for (i = 0; i < u.length; i++) {
            if (u[i] instanceof au)
                return (au) u[i];
        }
        return null;
    }

    int C() {
        int i;
        for (i = 0; i < u.length; i++) {
            if (u[i] instanceof au)
                return i;
        }
        return -1;
    }

    t6 a() {
        int i;
        for (i = 0; i < u.length; i++) {
            if (u[i] instanceof t6)
                return (t6) u[i];
        }
        return null;
    }

    int c() {
        int i;
        for (i = 0; i < u.length; i++) {
            if (u[i] instanceof t6)
                return i;
        }
        return -1;
    }

    fy a(ArrayList arraylist, sy sy, um um, wg wg)
            throws ub, tb, sb {
        if (s != null)
            return s.a(arraylist, sy, um, wg);
        else
            return null;
    }

    void a(Hashtable hashtable, hr hr, boolean flag)
            throws tb {
        if (s != null)
            s.a(hashtable, hr, flag);
    }

    void a(fy fy, fy fy1, dn dn, dn dn1, wu wu, wu wu1, Vector vector,
           String s1, lm lm1, qy qy1, it it)
            throws tb {
        if (s != null)
            s.a(fy, fy1, dn, dn1, wu, wu1, vector, s1, lm1, qy1, it);
    }

    boolean D() {
        return ((ou) n()).T();
    }

    boolean E() {
        return ((ou) n()).U();
    }

    boolean F() {
        return ((ou) n()).A();
    }

    boolean G() {
        return ((ou) n()).D();
    }

    public void a(HashSet hashset, HashSet hashset1, HashSet hashset2, HashSet hashset3) {
        int i;
        s.a(hashset, hashset1, hashset2, hashset3);
        for (i = 0; i < t.length; i++) {
            eu eu1 = t[i];
            String s1 = eu1.q();
            mt mt1 = fh.a(s1);
            if (mt1 != null)
                hashset.add(mt1);
        }
    }

    public void b(HashSet hashset) {
        s.b(hashset);
    }

    void b(Vector vector)
            throws tb {
        wt wt1 = u();
        if (wt1 != null)
            wt1.a(vector);
    }

    void a(hr hr, sy sy, ou ou1, it it, ly ly)
            throws tb {
        s.a(hr, sy, ou1, it, ly);
    }

    public void a(HashMap hashmap) {
        if (s != null)
            s.a(hashmap);
    }

    void a(sy sy, sy sy1, sy sy2, ux ux) {
        s.a(sy, sy1, sy2, ux);
    }

    void a(Vector vector, yg yg)
            throws tb {
        s.a(vector, yg);
    }

    void a(Hashtable hashtable, gd gd) {
        s.a(hashtable, gd);
    }

    void a(HashSet hashset, HashSet hashset1, HashSet hashset2) {
        int i;
        for (i = 0; i < t.length; i++) {
            eu eu1 = t[i];
            eu1.b(hashset1);
        }
        for (int j = 0; j < u.length; j++) {
            if (u[j] instanceof au)
                ((au) u[j]).b(hashset1);
        }
        if (s != null)
            s.a(hashset, hashset1, hashset2);
    }

    public void a(Hashtable hashtable) {
        int i;
        for (i = 0; i < u.length; i++) {
            u[i].a(hashtable);
        }
    }

    boolean H() {
        return s.A();
    }

    int a(dn dn, dn dn1, wu wu, wu wu1, lm lm1, qy qy1, um um,
          wg wg, int i, int j)
            throws tb, sb {
        if (s != null)
            return s.a(dn, dn1, wu, wu1, lm1, qy1, um, wg, i, j);
        else
            return 0;
    }

    void a(ArrayList arraylist, int i, int j)
            throws tb {
        if (s != null) {
            int k = w();
            if (k < j)
                d(j);
            int l = v();
            c(l + i);
            s.a(arraylist);
        }
    }

    void b(Hashtable hashtable)
            throws tb {
        int i;
        Vector vector;
        int j;
        i = u.length;
        vector = new Vector();
        for (j = 0; j < i; j++) {
            if (u[j] instanceof wt) {
                ((wt) u[j]).a(hashtable);
            } else {
                vector.addElement(u[j]);
            }
        }
        int k = vector.size();
        if (k < i) {
            u = new pt[k];
            vector.copyInto(u);
        }
        r = u.length;
        super.m = q();
        ((mt) h()).K = false;
    }

    void c(Hashtable hashtable)
            throws tb {
        int i;
        Vector vector;
        int j;
        i = u.length;
        vector = new Vector();
        for (j = 0; j < i; j++) {
            if (u[j] instanceof o5) {
                ((o5) u[j]).a(hashtable);
            } else {
                vector.addElement(u[j]);
            }
        }
        int k = vector.size();
        if (k < i) {
            u = new pt[k];
            vector.copyInto(u);
        }
        r = u.length;
        super.m = q();
    }

    void c(int i)
            throws tb {
        if (i <= 65535) {
            p = i;
        } else {
            throw new tb(z[7] + z() + z[8] + i + ")");
        }
    }

    void d(int i)
            throws tb {
        if (i <= 65535) {
            o = i;
        } else {
            throw new tb(z[16] + z() + z[8] + i + ")");
        }
    }

    boolean a(lu lu) {
        return s != null && s.a(lu);
    }

    public void a(Hashtable hashtable, boolean flag, PrintWriter printwriter, PrintWriter printwriter1)
            throws tb {
        int i;
        Vector vector;
        int j;
        i = u.length;
        vector = new Vector();
        for (j = 0; j < i; j++) {
            if (u[j] instanceof cu) {
                cu cu1 = (cu) u[j];
                cu1.a(hashtable);
                if (flag)
                    printwriter.println(z[3] + cu1.r() + z[2] + x() + z[4] + lt.a(j()));
                printwriter1.println(z[5] + cu1.r() + z[2] + x() + z[4] + lt.a(j()));
            } else {
                vector.addElement(u[j]);
            }
        }
        int k = vector.size();
        if (k < i) {
            u = new pt[k];
            vector.copyInto(u);
        }
        r = u.length;
        super.m = q();
    }

    protected void a(DataOutputStream dataoutputstream, Hashtable hashtable, nh nh1)
            throws IOException, tb {
        int i;
        if (s.C())
            s.B();
        super.a(dataoutputstream, hashtable, nh1);
        dataoutputstream.writeShort(o);
        dataoutputstream.writeShort(p);
        s.a(dataoutputstream);
        dataoutputstream.writeShort(q);
        for (i = 0; i < q; i++) {
            t[i].a(dataoutputstream);
        }
        int j;
        dataoutputstream.writeShort(r);
        for (j = 0; j < r; j++) {
            if (u[j] instanceof cu && u[j].q() > 0) {
                cu cu1 = (cu) u[j];
                if (cu1.s()) {
                    nh1.e(z[15] + cu1.r() + z[10]);
                } else {
                    nh1.e(z[13] + x() + z[14] + l() + z[11] + cu1.r() + z[12]);
                }
            }
            u[j].a(dataoutputstream, hashtable, nh1);
        }
    }

//    private static String z(char[] chs) {
//        for (int i = 0; i < chs.length; i++) {
//            byte key = 0;
//            switch (i % 5) {
//                case 0:
//                    key = 0x11;
//                    break;
//                case 1:
//                    key = 9;
//                    break;
//                case 2:
//                    key = 107;
//                    break;
//                case 3:
//                    key = 3;
//                    break;
//                default:
//                    key = 49;
//                    break;
//            }
//            chs[i] ^= key;
//        }
//        return new String(chs).intern();
//    }

    static {
        z = new String[]{
                "StackMap",
                "LocalVariableTable", "' in method '", "	Deleting unknown attribute '", "' in class ", "Deleting unknown attribute '",
                "StackMapTable", "Local variable count greater than 65535 in ", ". (", "   ", "'. The integrity of this attribute may be effected by obfuscation.",
                "' contains unknown attribute '", "'. The integrity of this attribute may be effected by obfuscation. Consider using the Trim function to delete it.",
                "Method '", "' in class '", "Method contain unknown attribute '",
                "Stack size greater than 65535 in "};
    }
}